Computing finite abstractions with robustness margins via local reachable set over-approximation

نویسندگان

  • Yinan Li
  • Jun Liu
  • Necmiye Ozay
چکیده

This paper proposes a method to compute finite abstractions that can be used for synthesizing robust hybrid control strategies for nonlinear systems. Most existing methods for computing finite abstractions utilize some global, analytical function to provide bounds on the reachable sets of nonlinear systems, which can be conservative and lead to spurious transitions in the abstract systems. This problem is even more pronounced in the presence of imperfect measurements and modelling uncertainties, where control synthesis can easily become infeasible due to added spurious transitions. To mitigate this problem, we propose to compute finite abstractions with robustness margins by over-approximating the local reachable sets of nonlinear systems. We do so by linearizing the nonlinear dynamics into linear affine systems and keeping track of the linearization error. It is shown that this approach provides tighter approximations and several numerical examples are used to illustrate of effectiveness of the proposed methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductively Finding a Reachable State Space Over-Approximation

We present an algorithm to find an overapproximation of the set of reachable states in a finite state machine. The algorithm works by inductively proving implications of the form a ⇒ b between pairs of nodes in the logic network. Because each implication proved is guaranteed to hold in every reachable state, the conjunction of the implications forms an over-approximation of the reachable state ...

متن کامل

Verifying Absence of ∞ Loops in Parameterized Protocols

ion An abstract version of a program is a “simplification” of the program, with less “detail”. As such, it over-approximates the behavior of the program. The point of abstraction is to simplify the verification, by obtaining a simpler program from which we can draw conclusions about the original system [CC77, Sif84, CGL92, LGS95, KP00]. Many techniques based on abstraction compute an over-appro...

متن کامل

Computing Optimal Control of Cascading Failure in DC Networks

We consider discrete-time dynamics, for cascading failure in DC networks, whose map is composition of failure rule with control actions. Supply-demand at the nodes is monotonically non-increasing under admissible control. Under the failure rule, a link is removed permanently if its flow exceeds capacity constraints. We consider finite horizon optimal control to steer the network from an arbitra...

متن کامل

Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems

In this paper, we present a new method for computing discrete abstractions of arbitrary memory span for nonlinear sampled systems with quantized output. In our method, abstractions are represented by collections of conservative approximations of reachable sets by polyhedra, which in turn are represented by collections of half-spaces. Important features of our approach are that half-spaces are s...

متن کامل

ESTIMATING REACHABLE STATES OF HYBRID SYSTEMS VIA l-COMPLETE APPROXIMATIONS

This contribution treats the estimation of reachable states for time invariant hybrid systems. Using the framework provided by Willems’ behavioural systems theory, we suggest a method based on l-complete approximations, which can be realized by finite state machines. The approximating behaviour is a superset of the original behaviour. Hence, the estimate of reachable states based on an l-comple...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1507.06248  شماره 

صفحات  -

تاریخ انتشار 2015